- recurrence relation method
- Макаров: метод рекуррентных соотношений
Универсальный англо-русский словарь. Академик.ру. 2011.
recurrence relation method
Смотреть что такое "recurrence relation method" в других словарях:
Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… … Wikipedia
Recurrence — and recurrent may refer to: *Recurrence relation, an equation which defines a sequence recursively *Poincaré recurrence theorem, Henri Poincaré s theorem on dynamical systems *Recurrence plot, a statistical plot that shows a pattern that re… … Wikipedia
Recurrence quantification analysis — (RQA) is a method of nonlinear data analysis (cf. chaos theory) for the investigation of dynamical systems. It quantifies the number and duration of recurrences of a dynamical system presented by its phase space trajectory.BackgroundThe… … Wikipedia
Generalized minimal residual method — In mathematics, the generalized minimal residual method (usually abbreviated GMRES) is an iterative method for the numerical solution of a system of linear equations. The method approximates the solution by the vector in a Krylov subspace with… … Wikipedia
Secant method — In numerical analysis, the secant method is a root finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f .The methodThe secant method is defined by the recurrence relation:x {n+1} = x n… … Wikipedia
Müller's method — is a root finding algorithm, a numerical method for solving equations of the form f(x) = 0. It is first presented by D. E. Müller in 1956. Müller s method is based on the secant method, which constructs at every iteration a line through two… … Wikipedia
Finite difference method — In mathematics, finite difference methods are numerical methods for approximating the solutions to differential equations using finite difference equations to approximate derivatives. Intuitive derivation Finite difference methods approximate the … Wikipedia
Multigrid method — Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in (but not… … Wikipedia
Power series method — In mathematics, the power series method is used to seek a power series solution to certain differential equations. Method Consider the second order linear differential equation: a 2(z)f (z)+a 1(z)f (z)+a 0(z)f(z)=0;!Suppose a 2 is nonzero for all … Wikipedia
Malecot's method of coancestry — Malecot s coancestry coefficient, f , refers to an indirect measure of genetic similarity of two individuals which was initially devised by the French mathematician Gustave Malécot. f is defined as the probability that any two alleles, sampled at … Wikipedia
Frobenius solution to the hypergeometric equation — In the following we solve the second order differential equation called the hypergeometric differential equation using Frobenius method, named after Ferdinand Georg Frobenius. This is a method that uses the series solution for a differential… … Wikipedia
